Knapsack problem - PDFSEARCH.IO - Document Search Engine

Knapsack problem
Results: 111

#	Item
81	310 TUGboat, Volume[removed]), No. 3 Macros Fast and secure multiple-option tests Add to Reading List Source URL: tug.org Language: English - Date: 1998-03-13 09:09:58 Combinatorial optimization Cryptography Dynamic programming Knapsack problem Operations research TeX Prime number Euclidean algorithm ALGOL 68 Theoretical computer science Mathematics Applied mathematics
82	Packing a Knapsack of Unknown Capacity Yann Disser∗ , Max Klimm, Nicole Megow† , and Sebastian Stiller Department of Mathematics, Technische Universität Berlin, Germany {disser,klimm,nmegow,stiller}@math.tu-berlin.d Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2014-06-06 08:08:21 Combinatorial optimization NP-complete problems Permutations Cryptography Knapsack problem Operations research Merkle–Hellman knapsack cryptosystem Fisher–Yates shuffle Universal property Theoretical computer science Mathematics Computational complexity theory
83	A Multi-Dimensional Multi-Commodity Covering Problem with Applications in Logistics∗ Preprint[removed], revised version from September 4th 2012, TU Berlin, Institut für Mathematik Felix G. König1 , Jannik Matuschke2 Add to Reading List Source URL: www.redaktion.tu-berlin.de Language: English - Date: 2012-09-04 06:38:33 Operations research NP-complete problems Matroid theory Dynamic programming Mathematical optimization Optimal control Sequence container Knapsack problem Linear programming Theoretical computer science Mathematics Applied mathematics
84	Multi-Dimensional Commodity Covering for Tariff Selection in Transportation∗ Felix G. König1 , Jannik Matuschke2 , and Alexander Richter2 1 TomTom International BV Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2012-09-11 03:22:31 Operations research NP-complete problems Greedy algorithm Knapsack problem Dynamic programming Sequence container Approximation algorithm Algorithm Optimization problem Theoretical computer science Mathematics Applied mathematics
85	Instance-Sensitive Robustness Guarantees for Sequencing with Unknown Packing and Covering Constraints∗ [Extended Abstract] † ‡ Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:06:05 Mathematical analysis Knapsack problem Dynamic programming Mathematical optimization Pi Μ operator Operations research Theoretical computer science Applied mathematics
86	A Genetic Algorithm for the Two-Dimensional Knapsack Problem with Rectangular Pieces Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Combinatorial optimization Operations research Packaging Bin packing problem Genetic algorithm Packing problem Knapsack problem Heuristic Mathematical optimization Theoretical computer science Mathematics Applied mathematics
87	A Tree Search Algorithm for Solving the Container Loading Problem Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Discrete geometry NP-complete problems Packaging Packing problem BL1 Box Knapsack problem Bin packing problem Cuboid Mathematics Theoretical computer science Geometry
88	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
89	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
90	Solving Knapsack Problems with Attribute Grammars Michael O’Neill, Robert Cleary, and Nikola Nikolov Biocomputing & Developmental Systems Group University of Limerick, Ireland [removed], [removed], Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2004-06-09 13:38:00 Compiler construction Combinatorial optimization NP-complete problems Operations research Knapsack problem Context-free grammar Attribute grammar Formal grammar Constraint Theoretical computer science Formal languages Applied mathematics

UPDATE